Wardrop Equilibrium in Discrete-Time Selfish Routing With Time-Varying Bounded Delays

This article presents a multicommodity, discrete-time, distributed, and noncooperative routing algorithm, which is proved to converge an equilibrium in the presence of heterogeneous, unknown, time-varying but bounded delays. Under mild assumptions on latency functions, describe cost associated with network paths, two algorithms are proposed: The former assumes that each commodity relies only measurements latencies its own paths; latter has (at least indirectly) access measures all paths. Both proven drive system state invariant set approximates contains Wardrop equilibrium, defined as no traffic flow over paths can improve unilaterally, achieving better reconstruction equilibrium. Numerical simulations show effectiveness proposed approach.